Recurrent Ring Dynamics in Two–dimensional Excitable Cellular Automata

نویسنده

  • Janko Gravner
چکیده

The Greenberg–Hastings model (GHM) is a simple cellular automaton which emulates two properties of excitable media: excitation by contact and a refractory period. We study two ways in which external stimulation can make ring dynamics in the GHM recurrent. The first scheme involves initial placement of excitation centers which gradually lose strength, i.e. each time they become inactive (and then stay so forever) with probability 1 − pf . In this case, the density of excited sites must go to 0; however, their long–term connectivity structure undergoes a phase transition as pf increases from 0 to 1. The second proposed rule utilizes continuous nucleation: new rings are started at every rested site with probability ps. We show that, for small ps, this dynamics makes a site excited about every p −1/3 s time units. This result yields some information about the asymptotic shape of a closely related random growth model. 1991 Mathematics Subject Classification. Primary 60K35.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Three-dimensional Cellular Automata for Reaction-Diffusion Systems

Cellular automata for reaction-diiusion systems are eecient enough to make the simulation of large three-dimensional systems feasible. The principal construction mechanisms used here are not much diierent from those for two-dimensional cellular automata. Diiusion is realized through a local av-erageing, and all the nonlinear reaction terms are collected in a table-lookup. The special issue in t...

متن کامل

Improved Frog Leaping Algorithm Using Cellular Learning Automata

In this paper, a new algorithm which is the result of the combination of cellular learning automata and frog leap algorithm (SFLA) is proposed for optimization in continuous, static environments.At the proposed algorithm, each memeplex of frogs is placed in a cell of cellular learning automata. Learning automata in each cell acts as the brain of memeplex, and will determine the strategy of moti...

متن کامل

Asymptotic Behavior of Excitable Cellular Automata

This research was partially supported by research grants to each of the authors from the National Science Foundation We study two families of excitable cellular automata known as the Greenberg–Hastings model and the cyclic cellular automaton. Each family consists of local deterministic oscillating lattice dynamics, with parallel discrete-time updating, parametrized by the range of interaction, ...

متن کامل

Fault-tolerant adder design in quantum-dot cellular automata

Quantum-dot cellular automata (QCA) are an emerging technology and a possible alternative for faster speed, smaller size, and low power consumption than semiconductor transistor based technologies. Previously, adder designs based on conventional designs were examined for implementation with QCA technology. This paper utilizes the QCA characteristics to design a fault-tolerant adder that is more...

متن کامل

Convolution Generated Motion as aLink Between Cellular

Cellular automata have been used to model the formation and dynamics of patterns in a variety of chemical, biological and ecological systems. However, for patterns in which sharp interfaces form and propagate, automata simulations can exhibit undesirable properties, including spurious anisotropy and poor representation of interface curvature eeects. These simulations are also prohibitively slow...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015